Advanced Computation Capacity Modeling for Delay-Constrained Placement of IoT Services
نویسندگان
چکیده
منابع مشابه
Modeling Opportunistic IoT Services in Open IoT Ecosystems
Internet of Thing (IoT) is transforming our physical world into a giant information system, daily providing novel, advanced, cyberphysical services. Differently from conventional computing services (e.g., web-services, and ubiquitous services) that are usually loosely impacted by contextawareness, co-location or transience, Internet of Things (IoT) services require to actually consider the over...
متن کاملA Greedy Algorithm for Capacity-Constrained Surrogate Placement in CDNs
One major factor that heavily affects the performance of a content distribution network (CDN) is placement of the surrogates. Previous works take a network-centric approach and consider only the network traffic. In this paper, we propose solutions to optimal surrogate placement, taking into consideration both network latency and capacity constraints on the surrogates. For CDNs with a tree topol...
متن کاملEfficient Capacity Provisioning in Delay Constrained
This paper addresses the problem of capacity provisioning in a QoS enabled IP network, subject to satisfying varying performance requirements for different traffic classes. These performance requirements are viewed in terms of mean end-to-end delays required for the various traffic classes or in terms of random variations of their delays (i.e., jitter) or a combination of both. The accuracy of ...
متن کاملCapacity-Constrained Voronoi Tessellations: Computation and Applications
Voronoi tessellations specify a partition of a given space according to a set of sites where all points in that space are assigned to the closest site. Capacity-constrained Voronoi tessellations are special cases of Voronoi tessellations in which the region of each site has a predefined area. For example, the capacity constraint could state that each region in a Voronoi tessellation must have t...
متن کاملAdvanced Bounded Shortest Multicast Algorithm for Delay Constrained Minimum Cost
The Bounded Shortest Multicast Algorithm (BSMA) is a very well-known one of delay-constrained minimum-cost multicast routing algorithms. Although the algorithm shows excellent performance in terms of generated tree cost, it suffers from high time complexity. For this reason, there is much literature relating to the BSMA. In this paper, the BSMA is analyzed. The algorithms and shortcomings are c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2020
ISSN: 1424-8220
DOI: 10.3390/s20143830